首页> 外文OA文献 >Optimal Placement Algorithms for Virtual Machines
【2h】

Optimal Placement Algorithms for Virtual Machines

机译:虚拟机的最优放置算法

摘要

Cloud computing provides a computing platform for the users to meet theirdemands in an efficient, cost-effective way. Virtualization technologies areused in the clouds to aid the efficient usage of hardware. Virtual machines(VMs) are utilized to satisfy the user needs and are placed on physicalmachines (PMs) of the cloud for effective usage of hardware resources andelectricity in the cloud. Optimizing the number of PMs used helps in cuttingdown the power consumption by a substantial amount. In this paper, we present an optimal technique to map virtual machines tophysical machines (nodes) such that the number of required nodes is minimized.We provide two approaches based on linear programming and quadratic programmingtechniques that significantly improve over the existing theoretical bounds andefficiently solve the problem of virtual machine (VM) placement in datacenters.
机译:云计算为用户提供了一个计算平台,以高效,经济高效的方式满足他们的需求。云中使用虚拟化技术来帮助有效利用硬件。虚拟机(VM)用于满足用户需求,并放置在云的物理机(PM)上,以有效利用云中的硬件资源和电力。优化使用的PM数量有助于大幅降低功耗。在本文中,我们提出了一种将虚拟机映射到物理机(节点)的最佳技术,以使所需节点的数量减到最少。我们提供了两种基于线性规划和二次规划技术的方法,可以显着改善现有的理论界限并有效地解决该问题。在数据中心中放置虚拟机(VM)的问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号